Contractive Dual Methods for Incentive Problems
نویسندگان
چکیده
Several recent papers have proposed recursive Lagrangian-basedmethods for solving dynamic contracting problems. Thesemethods give rise to Bellman operators that incorporate either a dual inf-sup or a saddle point operation. We give conditions that ensure the Bellman operator implied by a dual recursive formulation is contractive. JEL codes: C61, C73, D82, E61.
منابع مشابه
Recursive methods for incentive problems
Many separable dynamic incentive problems have primal recursive formulations in which utility promises serve as state variables. We associate families of dual recursive problems with these by selectively dualizing constraints. We make transparent the connections between recursive primal and dual approaches, relate value iteration under each and give conditions for such value iteration to be con...
متن کاملRewarding Multitasking: Negative Effects of an Incentive on Problem Solving Under Divided Attention
Research has consistently shown negative effects of multitasking on tasks such as problem solving. This study was designed to investigate the impact of an incentive when solving problems in a multitasking situation. Incentives have generally been shown to increase problem solving (e.g., Wieth & Burns, 2006), however, it is unclear whether an incentive can increase problem solving while attentio...
متن کاملPrimal-dual path-following algorithms for circular programming
Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...
متن کاملSome new results on semi fully fuzzy linear programming problems
There are two interesting methods, in the literature, for solving fuzzy linear programming problems in which the elements of coefficient matrix of the constraints are represented by real numbers and rest of the parameters are represented by symmetric trapezoidal fuzzy numbers. The first method, named as fuzzy primal simplex method, assumes an initial primal basic feasible solution is at hand. T...
متن کامل$C$-class Functions and Common Fixed Point Theorems Satisfying $varphi $-weakly Contractive Conditions
In this paper, we discuss and extend some recent common fixed point results established by using $varphi-$weakly contractive mappings. A very important step in the development of the fixed point theory was given by A.H. Ansari by the introduction of a $C-$class function. Using $C-$class functions, we generalize some known fixed point results. This type of functions is a very important class of ...
متن کامل